The interactive sum choice number of graphs
نویسندگان
چکیده
منابع مشابه
The Interactive Sum Choice Number of Graphs
We introduce a variant of the well-studied sum choice number of graphs, which we call the interactive sum choice number. In this variant, we request colours to be added to the vertices’ colour-lists one at a time, and so we are able to make use of information about the colours assigned so far to determine our future choices. The interactive sum choice number cannot exceed the sum choice number ...
متن کاملSum choice number of generalized θ-graphs
Let G = (V,E) be a simple graph and for every vertex v ∈ V let L(v) be a set (list) of available colors. G is called L-colorable if there is a proper coloring φ of the vertices with φ(v) ∈ L(v) for all v ∈ V . A function f : V → N is called a choice function of G and G is said to be f -list colorable if G is L-colorable for every list assignment L with |L(v)| = f(v) for all v ∈ V . The size of ...
متن کاملSum list coloring, the sum choice number, and sc-greedy graphs
Let G = (V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is said that G is f -choosable if for every assignment of lists of colors to the vertices of G for which the list sizes agree with f , there exists a proper coloring of G from the lists. The sum choice number is the minimum of the sum of list sizes for f over all choosable functions f for G. The su...
متن کاملSum Graphs of Small Sum Number
Given an integer r > 0, let G r = (V; E) denote a graph consisting of a simple nite undirected connected nontrivial graph G together with r isolated vertices K r. Let L : V ! Z + denote a labelling of the vertices of G r with distinct positive integers. Then G r is said to be a sum graph if there exists a labelling L such that for every distinct vertex pair u and v of V , (u; v) 2 E if and only...
متن کاملThe sum choice number of P3 Pn
A graph G is said to be f -choosable if there exists a proper coloring from every assignment of lists of colors to the vertices of G where the list sizes are given by f . The sum choice number of G is the minimum ∑ v∈V (G) f(v) over all f such that G is f -choosable. Here we determine the sum choice of the cartesian product P3 Pn to be 8n − 3 − bn/3c. The techniques used here have applicability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: 0166-218X
DOI: 10.1016/j.dam.2021.01.003